a profile hidden markov model (phmm) is widely used in assigning protein sequences to protein families. in this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. in other words, in the phmm, only the information of the left side of a hidden state is considered. however, it makes sense that considering the information of the b...

A profile hidden Markov model (PHMM) is widely used in assigning protein sequences to protein families. In this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. In other words, in the PHMM, only the information of the left side of a hidden state is considered. However, it makes sense that considering the information of the b...

The Baum-Welch algorithm is a technique for the maximum likelihood parameter estimation of probabilistic functions of Markov processes. We apply this technique to nonstationary Markov processes and explore a relationship between the Baum-Welch algorithm and the BCJR algorithm. Furthermore, we apply the Baum-Welch algorithm to two nonstationary Markov processes and obtain the turbo decoding algo...

The parameters of a Hidden Markov Model (HMM) are transition and emission probabilities‎. ‎Both can be estimated using the Baum-Welch algorithm‎. ‎The process of discovering the sequence of hidden states‎, ‎given the sequence of observations‎, ‎is performed by the Viterbi algorithm‎. ‎In both Baum-Welch and Viterbi algorithms‎, ‎it is assumed that...

the air transport industry is seeking to manage risks in air travels. its main objective is to detect abnormal behaviors in various flight conditions. the current methods have some limitations and are based on studying the risks and measuring the effective parameters. these parameters do not remove the dependency of a flight process on the time and human decisions. in this paper, we used an hmm...

This paper describes how we can use the generalized BaumWelch (GBW) algorithm to develop better extended BaumWelch (EBW) algorithms. Based on GBW, we show that the backoff term in the EBW algorithm comes from KL-divergence which is used as a regularization function. This finding allows us to develop a fast EBW algorithm, which can reduce the time of model space discriminative training by half, ...

We propose a new method for the estimation of parameters of hidden diffusion processes. Based on parametrization of the transition matrix, the Baum-Welch algorithm is improved. The algorithm is compared to the particle filter in application to the noisy periodic systems. It is shown that the modified Baum-Welch algorithm is capable of estimating the system parameters with better accuracy than p...

This note describes the Welch-Lynch fault-tolerant algorithm for clock synchronization. The original proof given by Welch and Lynch shows that the clocks of non-faulty nodes are maintained in approximate agreement. The worst-case skew is bounded by a constant which depends on network and algorithm parameters. We give a simpli ed proof of correctness and obtain tight synchronization bounds.

Power Spectral Density (PSD) shows strength of energy as a function of frequency. PSD computation can be done by the method called FFT. Welch algorithm is used to calculate Power Spectral Density. High computational complexity is the main drawback of Welch method. By using 50% overlap we are reducing the computational complexity of Welch method. Here N/2 point FFT is computed instead of N-point...